Stochastic algorithms for computing means of probability measures
نویسندگان
چکیده
Consider a probability measure μ supported by a regular geodesic ball in a manifold. For any p ≥ 1 we define a stochastic algorithm which converges almost surely to the p-mean ep of μ. Assuming furthermore that the functional to minimize is regular around ep, we prove that a natural renormalization of the inhomogeneous Markov chain converges in law into an inhomogeneous diffusion process. We give an explicit expression of this process, as well as its local characteristic.
منابع مشابه
بهینه سازی سازه های فضاکار بادرنظرگرفتن احتمال خرابی اعضاء و گره ها به کمک الگوریتم وراثتی اصلاح شده
Due to the probabilistic nature and uncertainties of structural parameters, reliability-based optimization will enable engineers to account for the safety of the structures and allow for its decision making applicability. Thus, reliability-based design will substitute deterministic rules of codes of practice. Space structures are of those types that have an exceedingly high range of applicabili...
متن کاملAn Efficient Predictive Model for Probability of Genetic Diseases Transmission Using a Combined Model
In this article, a new combined approach of a decision tree and clustering is presented to predict the transmission of genetic diseases. In this article, the performance of these algorithms is compared for more accurate prediction of disease transmission under the same condition and based on a series of measures like the positive predictive value, negative predictive value, accuracy, sensitivit...
متن کاملConfidence Interval Estimation of the Mean of Stationary Stochastic Processes: a Comparison of Batch Means and Weighted Batch Means Approach (TECHNICAL NOTE)
Suppose that we have one run of n observations of a stochastic process by means of computer simulation and would like to construct a condifence interval for the steady-state mean of the process. Seeking for independent observations, so that the classical statistical methods could be applied, we can divide the n observations into k batches of length m (n= k.m) or alternatively, transform the cor...
متن کاملSolving a Stochastic Cellular Manufacturing Model by Using Genetic Algorithms
This paper presents a mathematical model for designing cellular manufacturing systems (CMSs) solved by genetic algorithms. This model assumes a dynamic production, a stochastic demand, routing flexibility, and machine flexibility. CMS is an application of group technology (GT) for clustering parts and machines by means of their operational and / or apparent form similarity in different aspects ...
متن کاملGROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION
Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017